import java.util.*;

public class test {
    // 十六届蓝桥杯JavaB组国赛 A-农场监控
    public static void main(String[] args) {
        long n = 2025;
        long temp = 0;
        long sum = 0;
        for(int i = 0;i < n;i++){
            temp = n * n - (i * n);
            for(int j = 0;j < n;j++){
                sum += temp;
                temp = temp - (n - i);
            }
        }
        System.out.println(sum);
    }
    // 十六届蓝桥杯JavaB组国赛 C-答题数量
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int max = n;
        int same = 0;
        String s1 = in.next();
        String s2 = in.next();
        char[] arr1 = s1.toCharArray();
        char[] arr2 = s2.toCharArray();
        for(int i = 0;i < n;i++){
            if(arr1[i] == arr2[i]){
                same++;
            }
        }
        if(same > m){
            max -= (same - m);
        }else if(same == m){

        }else {
            max -= (m - same);
        }
        System.out.println(max);
    }
    // 十六届蓝桥杯JavaB组国赛 D-钟楼管理员
    public static void main2(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        while(t-- > 0){
            int n = in.nextInt();
            int k = in.nextInt();
            HashSet<Integer> set = new HashSet<>();
            int left = 0;
            int right = 0;
            // 默认都是顺时针
            right = k;
            // 1 2 3 4 5 6 7 8 9 10
            //
            // 10 9 8 7 6 5 4 3 2 1
            // 1  2 3 4 5 6 7 8 9 10
            int temp = (right % n) + 1;
            set.add(temp);
            while(right != 0){
                right--;
                left++;
                int sum = right - left;
                if(sum > 0){
                    temp = (sum % n) + 1;
                }else if(sum == 0) {
                    temp = 1;
                }else {
                    temp = n + (sum % n) + 1;
                }
                if(temp == n + 1){
                    temp = 1;
                }
                if(temp == 0){
                    temp = n;
                }
                set.add(temp);
            }
            System.out.println(set.size());
        }
    }
    // 十六届蓝桥杯JavaB组国赛 E-情绪链路
    public static void main3(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int[] arr = new int[n + 1];
        long Sum = 0;
        for(int i = 1;i <= n;i++){
            arr[i] = in.nextInt();
            Sum += arr[i];
        }
        long sum = 0;
        long max = arr[1];
        for(int i = 1;i <= n;i++){
            sum = Math.max(sum + arr[i],arr[i]);
            max = Math.max(sum,max);
        }
        Sum += (k - 1) * max;
        System.out.println(Sum);
    }
}